Generalized Cores
نویسندگان
چکیده
Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on vertex property function is presented. It is shown that for the local monotone vertex property functions the corresponding cores can be determined in time.
منابع مشابه
Generalized Two-mode Cores
The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important subnetworks in two-mode networks. The method combines and extends the ideas from generalized cores in one-mode networks and from (p, q)cores for two-mode networks. In this paper we introduce the notion...
متن کاملGeneralized Cores and Stable Sets for Fuzzy Games
Core elements (a la Aubin) of a fuzzy game can be associated with additive separable supporting functions of fuzzy games. Generalized cores whose elements consist of more general separable supporting functions of the game are introduced and studied. While the Aubin core of unanimity games can be empty, the generalized core of unanimity games is nonempty. Properties of the generalized cores and ...
متن کاملFully Generalized Graph Cores
A core in a graph is usually taken as a set of highly connected vertices. Although general, this definition is intuitive and useful for studying the structure of many real networks. Nevertheless, depending on the problem, different formulations of graph core may be required, leading us to the known concept of generalized core. In this paper we study and further extend the notion of generalized ...
متن کاملun 2 00 8 Cores of Geometric Graphs Chris
Cameron and Kazanidis have recently shown that rank-3 graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of generalized quadrangles and that when the number of points is sufficiently large, it is also true for the block graphs of Steiner systems and orthogonal arrays.
متن کاملParallel Solution of Generalized Complex Symmetric Eigenproblems Evaluation on HPCx
We investigate methods for efficiently solving a complex symmetric (non-Hermitian) generalized eigenvalue problem (EVP) Ax = λBx in parallel. An evaluation featuring up to 1024 CPU-cores evidences encouraging runtime behavior.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.DS/0202039 شماره
صفحات -
تاریخ انتشار 2002